Algorithms for Approximated Inference with Credal Networks
نویسندگان
چکیده
A credal network associates convex sets of probability distributions with graph-based models. Inference with credal networks aims at determining intervals on probability measures. Here we describe how a branch-and-bound based approach can be applied to accomplish approximated inference in polytrees iteratively. Our strategy explores a breadth-first version of branch-and-bound to compute outer approximations for the probability intervals. The basic idea is to refine the outer bounds calculated by the A/R+ algorithm until they are sufficiently precise or time/memory constraints have been exceeded . . .
منابع مشابه
EGL2U: Tractable Inference on Large Scale Credal Networks
Credal networks [1, 2] generalize Bayesian networks [3] by associating with variables (closed convex) sets of conditional probability mass functions, i.e., credal sets1, in place of precise conditional probability distributions. Credal networks are models of imprecise probabilities [4], which allow the capturing of incompleteness and imprecision of human knowledge and beliefs [1]. Credal networ...
متن کاملLocal Computation in Credal Networks
The goal of this contribution is to discuss local computation in credal networks — graphical models that can represent imprecise and indeterminate probability values. We analyze the inference problem in credal networks, discuss how inference algorithms can benefit from local computation, and suggest that local computation can be particularly important in approximate inference algorithms.
متن کاملInference in Credal Networks with Branch-and-Bound Algorithms
A credal network associates sets of probability distributions with directed acyclic graphs. Under strong independence assumptions, inference with credal networks is equivalent to a signomial program under linear constraints, a problem that is NP-hard even for categorical variables and polytree models. We describe an approach for inference with polytrees that is based on branch-and-bound optimiz...
متن کاملInference in Credal Networks using Multilinear Programming
A credal network is a graphical tool for representation and manipulation of uncertainty, where probability values may be imprecise or indeterminate. A credal network associates a directed acyclic graph with a collection of sets of probability measures; in this context, inference is the computation of tight lower and upper bounds for conditional probabilities. In this paper we present new algori...
متن کاملInference with Seperately Specified Sets of Probabilities in Credal Networks
We present new algorithms for inference in credal networksdirected acyclic graphs asso ciated with sets of probabilities. Credal networks are here interpreted as encoding strong indepen dence relations among variables. We first present a theory of credal networks based on separately specified sets of probabilities. We also show that inference with polytrees is NP-hard in this set ting. We th...
متن کامل